Concurrent forward bounding for distributed constraint optimization problems
نویسندگان
چکیده
Article history: Received 6 November 2011 Received in revised form 28 August 2012 Accepted 4 September 2012 Available online 7 September 2012
منابع مشابه
Concurrent Forward Bounding for DCOPs
A new search algorithm for solving distributed constraint optimization (DCOP) problems is presented. The proposed algorithm performs concurrent search on non intersecting parts of the global search space, using multiple search processes. Each Search Process uses synchronous forward bounding in its sub-space, to prune the remaining search space. Concurrent Forward Bounding (ConcFB) dynamically s...
متن کاملAsynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchronously. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps one consistent partial assignment at all times. Forward bounding propagates the bounds on the cost o...
متن کاملAsynchronous Forward Bounding for Distributed COPs
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and compute bounds on partial assignments asynchronously. The asynchronous bounds computation is based on the propagation of partial assignments. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps on...
متن کاملAsymmetric Distributed Constraint Optimization
The standard model of distributed constraints optimization problems (DCOPs), assumes that the cost of a constraint is checked by one of the agents involved in the constraint. For DCOPs this is equivalent to the assumption that each constraint has a global cost which applies to each of the participating agents and in other words that all constraints are symmetric. Many multi agent system (MAS) p...
متن کاملAsynchronous Forward Bounding Revisited
The Distributed Constraint Optimization Problem (DCOP) is a powerful framework for modeling and solving applications in multi-agent coordination. Asynchronous Forward Bounding (AFB BJ) is one of the best algorithms to solve DCOPs. We propose AFB BJ, a revisited version of AFB BJ in which we refine the lower bound computations. We also propose to compute lower bounds for the whole domain of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 193 شماره
صفحات -
تاریخ انتشار 2012